function (or map or transformation) f:D→C associates input argumentsx∈D to output valuesf(x)∈C
must be well-defined, i.e. x suffices to determine f(x) or x1=x2⟹f(x1)=f(x2)
set of arguments D is domain, set of all outputs R(f) is range
the codomain C, is a superset of R used for convenience (e.g. define f(x)=x2 with f:R→R instead of f:R→R+∪{0})
can also use notation xfx2−100, read "x maps under f to x2−100
composition of g:Y→Z and f:X→Y is g∘f:X→Z or g(f(x))∈Z for x∈X
note that R(f) should be a subset of the domain of g
identity mapid:Y→Y defined by id(y)=y is a function s.t. id∘f=f
left inverse is function g:R(f)→X s.t. g∘f=id or g(f(x))=x
right inverse is function h:Y→X s.t. f∘h=id or f(h(y))=y
two-sided inverse or inverse is a function that is both left and right inverses
is unique because if g1(x) and g2(x) both exhibit this property, g1(x)=g1∘(f∘g2)(x)=(g1∘f)∘g2(x)=g2(x)
inverse f−1(y) exists iff there is a unique x∈X such that f(x)=y
surjective (or onto) function f:X→Y has at least one x∈X such that f(x)=y for all y∈Y
has a right inverse (choose one of the paths if multiple, like the top one)
every f(x) has at least one corresponding x
injective (or one-to-one) function f:X→Y has at most one x∈X such that f(x)=y for all y=inY
has a left inverse
f(x1)=f(x2)⟹x1=x2
bijective function (or correspondence) is one-to-one and onto
exactly one element in domain is associated with each element in the codomain
has an inverse
restriction on f shrinks the domain (e.g. f^:R+∪{0}→R)
Example 7.1
The function f:Z→{0,1,2} defined by f(x) is the remainder when x is divided by 3 is surjective
Example 7.2
The function f:R→R defined by f(x)=2x is bijective
Example 7.3
The function g:R→R defined by g(x)=x is a right inverse of f(x)=x2 because (f∘g)(x)=(x)2=x but is not a left inverse because (g∘f)(x)=x2=x only when x≥0, not all x∈R
Isomorphisms
The association (ab)↔a+bxpreserves the structure of the spaces
holds through vector space operations of '+' and '⋅'
An isomorphism (written V≅W) is a map f:V→W that
is bijective
preserves structure, i.e. if v1,v2∈V then f(v1+v2)=f(v1)+f(v2)
and if v∈V and r∈R then f(r⋅v)=r⋅f(v)
Same correspondence exists even after vector addition or scalar multiplication
Proving Isomorphism
Prove injectivity, i.e. for v1,v2∈V, prove f(v1)=f(v2)⟹v1=v2
Prove surjectivity, i.e. for w∈W prove ∃v∈V s.t. f(v)=w
Prove it preserves addition, i.e. for v1,v2∈V, prove f(v1+v2)=f(v1)+f(v2)
Prove is preserves scalar multiplication, i.e. for v∈V and r∈R, f(r⋅v)=r⋅f(v)
First two prove bijectivity, last two proves structure-preserving
Example 7.4
Prove P2≅R3 under the map f(a0+a1x+a2x2)=⎝⎜⎛a0a1a2⎠⎟⎞
Condition 1: f(a0+a1x+a2x2)=f(b0+b1x+b2x2) ⟹⎝⎜⎛a0a1a2⎠⎟⎞=⎝⎜⎛b0b1b2⎠⎟⎞ ⟹a0=b0,a1=b1,a2=b2 →a0+a1x+a2x2=b0+b1x+b2x2
Condition 2:
For any w=⎝⎜⎛a0a1a2⎠⎟⎞∈R3, the corresponding element of the domain is a0+a1x+a2x2 which is part of the domain
Condition 3: f((a0+a1x+a2x2)+(b0+b1x+b2x2))=f((a0+b0)+(a1+b1)x+(a2+b2)x2)=⎝⎜⎛a0+b0a1+b1a2+b2⎠⎟⎞=⎝⎜⎛a0a1a2⎠⎟⎞+⎝⎜⎛b0b1b2⎠⎟⎞=f(a0+a1x+a2x2)+f(b0+b1x+b2x2)
Condition 4: f(r⋅(a0+a1x+a2x2))=f(ra0+ra1x+ra2x2)=⎝⎜⎛ra0ra1ra2⎠⎟⎞=r⎝⎜⎛a0a1a2⎠⎟⎞=rf(a0+a1x+a2x2)
Thus all four conditions are proved and f is an isomorphism. Therfore, R2≅R3
Example 7.5
The function f:R2→R2 f((xy))=(x2y2)
does not preserve addition since f((10)+(20))=(90)=f((10))+f((20))
An automorphism maps a space to itself
Examples 7.6
ds:R2→R2, multiply by nonzero scalar s
Maps space of R2 to itself, but is a dilation
tθ:R2→R2, rotate by θ
Maps space of R2 to itself, but rotates the vector
fl:R2→R2, reflect over line l
Maps space of R2 to itself, but flips the vector over a line
An isomorphism maps the zero vector to the zero vector
Proof
Consider an isomorphism f:V→W with v∈V f(0V)=f(0⋅v)=0⋅f(v)=0w
For any map f:V→W between vector spaces, these statements are equivalent:
f preserves structure f(v1+v2)=f(v1)+f(v2) and f(cv)=cf(v)
f preserves linear combinations of a finite number of vectors f(c1v1+⋯+cnvn)=c1f(v1)+⋯+cnf(vn)
The inverse of a isomorphism is also an isomorphism.
Both are intuitive, though a proof would be required
Proof for equivalency uses induction
Proof for inverse one involves evaluating the conditions
Isomorphism is an equivalence relation
Proof Outline
Reflexivity: space is isomorphic to itself by the identity map
Symmetry: the inverse of an isomorphism is also an isomorphism
Transitivity: evaluate the isomorphism conditions
Vector spaces are isomorphic iff they have the same dimension
Proof
First prove isomorphic ⟹ same dimension
We prove that if f:V→W is an isomorphism and the basis for V is B=⟨β1,...,βn⟩ then its image D=⟨f(β1),...,f(βn)⟩ is the basis of the codomain W. The reverse is equivalent by simply taking f−1 instead.
Fix any w∈W. Since f is onto there must exist a v∈V s.t. f(v)=w. Express f(v) as f(v1β1+⋯+vnβn)=v1f(β1)+⋯+vnf(βn) so D spans W.
For linear independence, 0W=c1f(β1)+⋯+cnf(βn)=f(c1β1+⋯+cnβn)
Since f is one-to-one, only f(0V)=0W, and since B is linearly independent, all ci's must be 0.
Next, prove same dimension ⟹ isomorphic.
We prove that all n-dimensional spaces are isomorphic to Rn. Then by transitivity, the statement will be proven.
The map v=v1β1+⋯+vnβnRepB⎝⎜⎜⎛v1⋮vn⎠⎟⎟⎞
This function is one-to-one because if RepB(u1β1+⋯+unβn)=RepB(v1β1+⋯+vnβn)
then ⎝⎜⎜⎛u1⋮un⎠⎟⎟⎞=⎝⎜⎜⎛v1⋮vn⎠⎟⎟⎞
which implies ui=vi for i=1,...,n, implying u1β1+⋯+unβn=v1β1+⋯+vnβ
The function is onto because every w=⎝⎜⎜⎛w1⋮wn⎠⎟⎟⎞
is an image of v∈V, namely w=RepB(w1β1+⋯+wnβn)
The function preserves structure because RepB(r⋅u+s⋅v)====RepB((ru1+sv1)β1+⋯+(run+svn)βn)⎝⎜⎜⎛ru1+sv1⋮run+svn⎠⎟⎟⎞r⎝⎜⎜⎛u1⋮un⎠⎟⎟⎞+s⎝⎜⎜⎛v1⋮vn⎠⎟⎟⎞r⋅RepB(u)+s⋅RepB(v)
So RepB is an isomorphism, so any n-dimensional space is isomorphic to Rn
Conclusion:
Every finite-dimensional vector space is isomorphic to exactly one of the Rn→ canonical representative